/* Copyright (c) 2006 by M Aamir Maniar
 * 
 * Permission is hereby granted, free of charge, to any person obtaining 
 * a copy of this software and associated documentation files (the 
 * "Software"), to deal in the Software without restriction, including 
 * without limitation the rights to use, copy, modify, merge, publish, 
 * distribute, sublicense, and/or sell copies of the Software, and to 
 * permit persons to whom the Software is furnished to do so, subject to 
 * the following conditions:
 * 
 * The above copyright notice and this permission notice shall be 
 * included in all copies or substantial portions of the Software.
 * 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 * 
 * */

namespace Generic.Algorithms.Sorting
{
	using System;
	using System.Collections.Generic;
	using System.Text;
    using Generic.Utils;

	public class BubbleSortStrategy<T>: SortStrategy<T>
		where T : IComparable
	{

        public BubbleSortStrategy()
        {
        }

		public BubbleSortStrategy(IList<T> list) : base(list)
		{
		}

		public override void Sort(SortDirection sortDirection)
		{
            base.Sort(sortDirection);

			bool descending = (sortDirection == SortDirection.Descending) ? true : false;
			for (int i = List.Count - 1; i > 0; i--)
			{
				for (int j = 0; j < i; j++)
				{
					if ((CompareTo(List[j], List[j + 1]) > 0) ^ descending)
					{
						Swap(j, j + 1);
					}
				}
			}
		}
	}
}
